Rank 2 Types for Term Graph Rewriting
نویسنده
چکیده
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [5], a notion of principal pair which generalizes ml’s principal type property.
منابع مشابه
Rank 2 Types for Term Graph Rewriting Extended
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assignment is decidable through defining, using the extended notion of unification from [5], a notion of principal pair which generalizes ml’s principal type property.
متن کاملRank 2 Intersection Type Assignment in Term Rewriting Systems
A notion of type assignment on Curryfied Term Rewriting Systems is introduced that uses Intersection Types of Rank 2, and in which all function symbols are assumed to have a type. Type assignment will consist of specifying derivation rules that describe how types can be assigned to terms, using the types of function symbols. Using a modified unification procedure, for each term the principal pa...
متن کاملTerm Graphs and Principal Types for X
In this paper we study the calculus of circuits X , as first presented in [13] and studied in detail in [5]. We will present a number of new implementations of X using term graph rewriting techniques, which are improvements of the technique used in [6]. We will show that alpha conversion can be dealt with ‘on the fly’, and that explicit copying can be avoided, by presenting, discussing and comp...
متن کاملModes of Convergence for Term Graph Rewriting
Term graph rewriting provides a simple mechanism to finitely represent restricted forms of infinitary term rewriting. The correspondence between infinitary term rewriting and term graph rewriting has been studied to some extent. However, this endeavour is impaired by the lack of an appropriate counterpart of infinitary rewriting on the side of term graphs. We aim to fill this gap by devising tw...
متن کاملA 2-Categorical Presentation of Term Graph Rewriting
It is well-known that a term rewriting system can be faithfully described by a cartesian 2-category, where horizontal arrows represent terms, and cells represent rewriting sequences. In this paper we propose a similar, original 2-categorical presentation for term graph rewriting. Building on a result presented in 8], which shows that term graphs over a given signature are in one-to-one correspo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 75 شماره
صفحات -
تاریخ انتشار 2002